By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 17, Issue 3, pp. 427-628

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Functional Approach to Data Structures and Its Use in Multidimensional Searching

Bernard Chazelle

pp. 427-462

Parallel Time $O(\log n)$ Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM

Philip N. Klein and John H. Reif

pp. 463-485

A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs

Xin He and Yaacov Yesha

pp. 486-491

On Search Times for Early-Insertion Coalesced Hashing

Boris Pittel and Jenn-Hwa Yu

pp. 492-503

Lowness Properties of Sets in the Exponential-Time Hierarchy

R. Book, P. Orponen, D. Russo, and O. Watanabe

pp. 504-516

Monotone Bipartite Graph Properties are Evasive

Andrew Chi-Chih Yao

pp. 517-520

Distance-Hereditary Graphs, Steiner Trees, and Connected Domination

Alessandro D'Atri and Marina Moscarini

pp. 521-538

A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach

Dorit S. Hochbaum and David B. Shmoys

pp. 539-551

A Graph Theoretic Approach to Statistical Data Security

Dan Gusfield

pp. 552-571

Minimum Spanning Trees in $k$-Dimensional Space

Pravin M. Vaidya

pp. 572-582

Some Geometry for General River Routing

Alan Siegel and Danny Dolev

pp. 583-605

Relations between Concurrent-Write Models of Parallel Computation

Faith E. Fich, Prabhakar Ragde, and Avi Wigderson

pp. 606-627

Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles

Timothy J. Long

p. 628